CLIMP: Clustering Motifs via Maximal Cliques with Parallel Computing Design
نویسندگان
چکیده
منابع مشابه
CLIMP: Clustering Motifs via Maximal Cliques with Parallel Computing Design
A set of conserved binding sites recognized by a transcription factor is called a motif, which can be found by many applications of comparative genomics for identifying over-represented segments. Moreover, when numerous putative motifs are predicted from a collection of genome-wide data, their similarity data can be represented as a large graph, where these motifs are connected to one another. ...
متن کاملThe Parallel Maximal Cliques Algorithm for Protein Sequence Clustering
Problem statement: Protein sequence clustering is a method used to discover relations between proteins. This method groups the proteins based on their common features. It is a core process in protein sequence classification. Graph theory has been used in protein sequence clustering as a means of partitioning the data into groups, where each group constitutes a cluster. Mohseni-Zadeh introduced ...
متن کاملComputing maximal cliques in link streams
A link stream is a collection of triplets (t, u, v) indicating that an interaction occurred between u and v at time t. We generalize the classical notion of cliques in graphs to such link streams: for a given ∆, a ∆-clique is a set of nodes and a time interval such that all pairs of nodes in this set interact at least once during each sub-interval of duration ∆. We propose an algorithm to enume...
متن کاملCLICK: Clustering Categorical Data using K-partite Maximal Cliques
Clustering is one of the central data mining problems and numerous approaches have been proposed in this field. However, few of these methods focus on categorical data. The categorical techniques that do exist have significant shortcomings in terms of performance, the clusters they detect, and their ability to locate clusters in subspaces. This work introduces a novel algorithm called Click, wh...
متن کاملCode Optimization for DNA Computing of Maximal Cliques
Since the Adleman s experimental demonstration of its feasibility DNA computing has been applied to a number of combinatorial optimization problems Several experimental results have shown that DNA strands can be used to compute solutions to NP complete problems Usually they employ random codes to represent candidate solutions in DNA However some codes have better error tolerance than others sin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PLOS ONE
سال: 2016
ISSN: 1932-6203
DOI: 10.1371/journal.pone.0160435